Aximo: Automated Axiomatic Reasoning for Information Update
نویسندگان
چکیده
Aximo is a software written in C++ that verifies epistemic properties of dynamic scenarios in multi-agent systems. The underlying logic of our tool is based on the algebraic axiomatics of Dynamic Epistemic Logic. We also present a new theoretical result: the worst case complexity of the verification problem of Aximo.
منابع مشابه
Steps Toward a Computational
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-ord...
متن کاملSteps Toward a Computational Metaphysics
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-ord...
متن کاملMessage-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection
Thanks to recent advances, AI Planning has become the underlying technique for several applications. Figuring prominently among these is automated Web Service Composition (WSC) at the “capability” level, where services are described in terms of preconditions and effects over ontological concepts. A key issue in addressing WSC as planning is that ontologies are not only formal vocabularies; they...
متن کاملCAISL: Simplification Logic for Conditional Attribute Implications
In this work, we present a sound and complete axiomatic system for conditional attribute implications (CAI s) in Triadic Concept Analysis (TCA). Our approach is strongly based on the Simplification paradigm which offers a more suitable way for automated reasoning than the one based on Armstrong’s Axioms. We also present an automated method to prove the derivability of a CAI from a set of CAI s.
متن کاملA Veri cation Calculus for the TAO Coordination Model
The TAO coordination model combines logical concepts and concurrency mechanisms: a set of processes cooperate via a common, content addressable, shared state. Computation and communication are achieved through queries and updates of the common store, the basic statements in this paradigm. A query checks whether some information is or is not entailed by the store, and an update changes the conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 231 شماره
صفحات -
تاریخ انتشار 2009